A stabilized normal form algorithm for generic systems of polynomial equations
نویسندگان
چکیده
منابع مشابه
A Stabilized Normal Form Algorithm for Generic Systems of Polynomial Equations
We propose a numerical linear algebra based method to find the multiplication operators of the quotient ring C[x]/I associated to a zero-dimensional ideal I generated by n C-polynomials in n variables. We assume that the polynomials are generic in the sense that the number of solutions in Cn equals the Bézout number. The main contribution of this paper is an automated choice of basis for C[x]/I...
متن کاملCoupled systems of equations with entire and polynomial functions
We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1} A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We derive a priory estimates for the sums of the rootsof the considered system andfor the counting function of roots.
متن کاملA fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix
Given a square, nonsingular matrix of univariate polynomials F ∈ K[x] over a field K, we give a fast, deterministic algorithm for finding the Hermite normal form of F with complexity O (nωd) where d is the degree of F. Here soft-O notation is Big-O with log factors removed and ω is the exponent of matrix multiplication. The method relies of a fast algorithm for determining the diagonal entries ...
متن کاملA Fast Las Vegas Algorithm for Computing the Smith Normal Form of a Polynomial Matrix
A Las Vegas probabilistic algorithm is presented that finds the Smith normal form S ∈ Q[x] of a nonsingular input matrix A ∈ Z [x]. The algorithm requires an expected number of O (̃nd(d + n log ||A||)) bit operations (where ||A|| bounds the magnitude of all integer coefficients appearing in A and d bounds the degrees of entries of A). In practice, the main cost of the computation is obtaining a ...
متن کاملA Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations
Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2018
ISSN: 0377-0427
DOI: 10.1016/j.cam.2018.04.021